On transitive polynomials modulo integers
نویسندگان
چکیده
A polynomial P (x) with integer coefficients is said to be transitive modulo m, if for every x, y ∈ Z there exists k ≥ 0 such that P (x) = y (mod m). In this paper, we construct new examples of transitive polynomials modulo prime powers and partially describe cubic and quartic transitive polynomials. We also study the orbit structure of affine maps modulo prime powers.
منابع مشابه
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximize the bound on the solutions of p(x, y) in a purely combinatorial way. We give various construction rules for different shapes of p(x, y)’s Newton polygon. Our method has several applications. Most interestingly, we reduc...
متن کاملComputing totally positive algebraic integers of small trace
We construct minimal polynomials of totally positive algebraic integers of small absolute trace by consideration of their reductions modulo auxiliary polynomials. Many new examples of such polynomials of minimal absolute trace (for given degree) are found. The computations are pushed to degrees that previously were unattainable, and one consequence is that the new examples form the majority of ...
متن کاملSome results on counting roots of polynomials and the Sylvester resultant
We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo n and the second on the distribution of the roots of the Sylvester resultant of two multivariate polynomials. The second result has application to polynomial GCD computation and solving polynomial diophantine equations.
متن کاملOn Ternary Inclusion - Exclusion Polynomials
Taking a combinatorial point of view on cyclotomic polynomials leads to a larger class of polynomials we shall call the inclusion-exclusion polynomials. This gives a more appropriate setting for certain types of questions about the coefficients of these polynomials. After establishing some basic properties of inclusion-exclusion polynomials we turn to a detailed study of the structure of ternar...
متن کاملKineski teorem o ostatcima za polinome
We start by giving a brief description of the classical Chinese remainder theorem for integers, after whichwe define the greatest common divisor of two polynomials and congruences modulo a polynomial. These concepts allow us to state and prove the Chinese remainder theorem for polynomials. After presenting some important consequences of that theorem, we give its applications to the factorizatio...
متن کامل